#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define endl '\n'
const int N = 2e5 + 5;

int n, m, v;
int a[N];

void solve() {
  cin >> n >> m >> v;
  ll tot = (n - 1) + 1ll * (n - 2) * (n - 3) / 2;
  if (tot < m || m < n - 1) {
    cout << -1;
    return;
  }
  vector<pii> res;
  rep(i, 1, n) {
    if (i != v) res.push_back(pii(i, v));
  }
  int st = v == 1 ? 3 : 2;
  rep(i, st, n) {
    if (i == v) continue;
    if (res.size() >= m) break;
    rep(j, i + 1, n) {
      if (j == v) continue;
      res.push_back(pii(i, j));
      if (res.size() >= m) break;
    }
  }
  for (pii p : res) {
    cout << p.first << ' ' << p.second << endl;
  }
  return;
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int t;
  t = 1;
  while (t--) solve();
  return 0;
}